Lack of constraint-free crane path planning is one of the critical concerns in the dynamic on-site assembly process of prefabrication housing production (PHP). For decades, researchers and practitioners have endeavored to improve both the efficiency and safety of crane path planning from either static environment or re-planning the path when colliding with constraints or periodically updating the path in the dynamic environment. However, there is a lack of approach related to the in-depth exploration of the nature of dynamic constraints so as to assist the crane operators in making adaptive path re-planning decisions by categorizing and prioritizing constraints. To address this issue, this study develops the smart work packaging (SWP)-enabled constraints optimization service. This service embraces the core characteristics of SWP, including adaptivity, sociability, and autonomy to achieve autonomous initial path planning, networked constraints classification, and adaptive decisions on path re-planning. This service is simulated and verified in the BIM environment, and it is found that SWP-enabled constraints optimization service can generate the constraint-free path when it is necessary. 相似文献
An evaluation of XML queries such as XQuery or XPath expressions represents a challenging task due to its complexity. Many algorithms have been introduced to cope with this problem. Some of them, called binary joins, evaluate separated parts of a query and subsequently merge intermediate results, while the others, called holistic twig joins, evaluate a query as a whole. Moreover, these algorithms also differ in what index data structure they use to handle XML data. There exist cost-based approaches utilizing binary joins and various index data structures; however, they share a limitation. The limitation is that they cannot perform a join between query nodes not having a direct XPath relationship. Such a join can be advantageous especially if their joint selectivity is high. Since holistic joins work with all query nodes they overcome this limitation. In this article, we introduce such a holistic twig join called CostTwigJoin. To the best of our knowledge, CostTwigJoin is the first holistic join capable of combining various index data structures during an evaluation of an XML query. Usage of the holistic join has yet another advantage for cost-based approaches: an optimizer does not have to resolve the order of binary joins; therefore, the search space is reduced. In this article, we perform thorough experiments on hundreds of queries to evaluate our approach and demonstrate its advantages. 相似文献
Optimization of tool path planning using metaheuristic algorithms such as ant colony systems (ACS) and particle swarm optimization (PSO) provides a feasible approach to reduce geometrical machining errors in 5-axis flank machining of ruled surfaces. The optimal solutions of these algorithms exhibit an unsatisfactory quality in a high-dimensional search space. In this study, various algorithms derived from the electromagnetism-like mechanism (EM) were applied. The test results of representative surfaces showed that all EM-based methods yield more effective optimal solutions than does PSO, despite a longer search time. A new EM-MSS (electromagnetism-like mechanism with move solution screening) algorithm produces the most favorable results by ensuring the continuous improvement of new searches. Incorporating an SPSA (simultaneous perturbation stochastic approximation) technique further improves the search results with effective initial solutions. This work enhances the practical values of tool path planning by providing a satisfactory machining quality. 相似文献
This paper presents experimental and numerical study of the fatigue crack growth of hollowed pre-notched plates with multiple site damages (MSD). The numerical analyses were performed using finite element method. Experiments were carried out to validate the numerical results. Fatigue tests of aluminum sheets with MSD cracks were conducted to evaluate the effects of some parameters such as the thickness, hole diameter and central distance of the holes. The results show that the distance of the holes has greatest and size of the hole has little effects on the fatigue lives. Nucleation of cracks strongly depends on the thickness, distance and hole size. 相似文献
Objective: Establish an effective experimental strategy to determine the compatibility of rubber closures for drugs.
Significance: Various types of rubber closures with different compositions are available for drug packaging. Many additives of rubber closures can be released from rubber closures and may affect the quality of drugs and pose a risk to human health. In this study, we aimed to determine the relationship between cephalosporin structure, solution clarity, and rubber closure compatibility using volatile components profile of butyl rubber closures.
Methods: Two opposite polarity gas chromatography (GC) systems and GC-mass spectrometry (MS) were used to achieve rapid qualitative determination of the main volatile components in rubber closures. Simulated adsorption experiment was performed to investigate the adsorption of main volatile components in rubber closures by cephalosporins with different side chain structures, and to determine the effects of adsorption on solution clarity.
Results: A volatile components screening library of rubber closures was established and the structures of some volatile component were confirmed. The specific adsorption of the structure of cephalosporins on volatile components from rubber closures was studied.
Conclusion: Based on the results of this study, rubber closures with good compatibility for cephalosporins with different side chain structures can be selected rapidly. This experimental strategy not only facilitates the screening of suitable rubber closures more effectively, but also enables the quick determination of volatile components adsorbed by drugs. 相似文献
The objective of this paper is to review and document the mine fleet management systems’ models and algorithms. The purpose is to understand the algorithms behind the fleet management systems and the proposed academic solutions in this area to identify any gaps in the current literature and to open up opportunities to establish research questions that need to be addressed in an integrated simulation and optimisation operational planning research framework. In this paper, we review industrial fleet management systems and the main academic algorithms behind such systems. The fleet management systems are divided into three subsequently related problems to review: shortest path, production optimisation and real-time dispatching. Finally, the limitations of current algorithms for fleet management systems are documented in terms of mining practice feasibility and optimality of the solution on large-scale problems. The results of this literature review enable us to evaluate the logical links between major components of an integrated simulation and optimisation operational planning framework with current theory of fleet management systems. 相似文献